Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
نویسندگان
چکیده
منابع مشابه
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
This paper deals with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chordal graphs. It is known that GI problem is GI complete even for some special graph classes including regular graphs, bipartite graphs, chordal graphs, comparability graphs, split graphs, and k-trees with unbounded k. On the other side, the relative complexity of the GI probl...
متن کاملStrongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
A graph class is sandwich monotone if, for every pair of its graphs G1 = (V,E1) and G2 = (V,E2) with E1 ⊂ E2, there is an ordering e1, . . . , ek of the edges in E2 \E1 such that G = (V,E1 ∪ {e1, . . . , ei}) belongs to the class for every i between 1 and k. In this paper we show that strongly chordal graphs and chordal bipartite graphs are sandwich monotone, answering an open question by Bakon...
متن کاملStrongly Orderable Graphs a Common Generalization of Strongly Chordal and Chordal Bipartite Graphs
In this paper those graphs are studied for which a so-called strong ordering of the vertex set exists. This class of graphs, called strongly orderable graphs, generalizes the strongly chordal graphs and the chordal bipartite graphs in a quite natural way. We consider two characteristic elimination orderings for strongly orderable graphs, one on the vertex set and the second on the edge set, and...
متن کاملRecognizing Chordal-Bipartite Probe Graphs
A graph G is chordal-bipartite probe if its vertices can be partitioned into two sets P (probes) and N (non-probes) where N is a stable set and such thatG can be extended to a chordal-bipartite graph by adding edges between non-probes. A bipartite graph is called chordal-bipartite if it contains no chordless cycle of length strictly greater than 5. Such probe/non-probe completion problems have ...
متن کاملTreewidth of Chordal Bipartite Graphs
Chordal bipartite graph are exactly those bipartite graph in which every cycle of length at least six has a chord. The treewidth of a graph G is the smallest maximum cliquesize among all chordal supergraphs of G decreased by one. We present a polynomial time algorithm for the exact computation of the treewidth of all chordal bipartite graphs. keywords: Graph algorithms, Algorithms and Data Stru...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2005
ISSN: 0166-218X
DOI: 10.1016/j.dam.2004.06.008